Square and stretch multigrid for stochastic matrix eigenproblems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Square & Stretch Multigrid for Stochastic Matrix Eigenproblems∗∗

A novel multigrid algorithm for computing the principal eigenvector of column stochastic matrices is developed. The method is based on the Exact Interpolation Scheme multigrid approach of Brandt and Ron, whereby the prolongation is adapted to yield a better and better coarse representation of the sought eigenvector. A special feature of the present approach is the squaring of the stochastic mat...

متن کامل

Solving Mesh Eigenproblems with Multigrid Efficiency

Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow to compute a few of the smallest eigenvalues and the eigenfunctions within optimal or quasi-optimal computational complexity. A review is given on three multigrid solvers for elliptic eigenproblems. Numerical results are presented for a simple model problem.

متن کامل

ON CONEIGENVALUES OF A COMPLEX SQUARE MATRIX

In this paper, we show that a matrix A in Mn(C) that has n coneigenvectors, where coneigenvaluesassociated with them are distinct, is condiagonalizable. And also show that if allconeigenvalues of conjugate-normal matrix A be real, then it is symmetric.  

متن کامل

Matrix - Dependent Multigrid - Homogenization

For problems with strongly varying or discontinuous diiusion coeecients we present a method to compute coarse-scale operators and to approximately determine the eeective diiusion tensor on the coarse-scale level. The approach is based on techniques that are used in multigrid, such as matrix-dependent prolongations and the construction of coarse grid operators by means of the Galerkin approximat...

متن کامل

Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems

In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term recurrence relations complemented with error free transformations yields some compensated schemes which significantly improve the accuracy of computed r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Linear Algebra with Applications

سال: 2010

ISSN: 1070-5325

DOI: 10.1002/nla.708